package leetcode_2501_2600;

import java.util.HashSet;
import java.util.Set;

public class LeeCode_2568 {
    public static void main(String[] args) {

    }
    private static int minImpossibleOR(int[] nums) {
        Set<Integer> set = new HashSet<>();
        for (int num : nums) {
            set.add(num);
        }
        for (int i = 0; i < 31; i++) {
            if (!set.contains(1 << i)){
                return 1 << i;
            }
        }
        return 0;
    }
}